On the complexity of the permanent in various computational models
نویسندگان
چکیده
We answer a question in [10], showing the regular determinantal complexity of the determinant detm is O(m ). We answer questions in, and generalize results of [2], showing there is no rank one determinantal expression for perm m or detm when m ≥ 3. Finally we state and prove several “folklore” results relating different models of computation.
منابع مشابه
A MULTI-OBJECTIVE OPTIMIZATION MODEL FOR PROJECT PORTFOLIO SELECTION CONSIDERING AGGREGATE COMPLEXITY: A CASE STUDY
Existing project selection models do not consider the complexity of projects as a selection criterion, while their complexity may prolong the project duration and even result in its failure. In addition, existing models cannot formulate the aggregate complexity of the selected projects. The aggregated complexity is not always equal to summation of complexity of projects because of possible syne...
متن کاملElectricity Load Forecasting by Combining Adaptive Neuro-fuzzy Inference System and Seasonal Auto-Regressive Integrated Moving Average
Nowadays, electricity load forecasting, as one of the most important areas, plays a crucial role in the economic process. What separates electricity from other commodities is the impossibility of storing it on a large scale and cost-effective construction of new power generation and distribution plants. Also, the existence of seasonality, nonlinear complexity, and ambiguity pattern in electrici...
متن کاملImpact of the Confluence Angle on Flow Field and Flowmeter Accuracy in Open Channel Junctions
Open channel junction is one of the most common hydraulic structures that are used in various practical situations such as sewer, drainage, and flood control systems. Knowing the fluid flow behavior, is one of the most important topics in designing the efficient open channel junctions. The complexity and deviation of flow in the junction’s zone disrupts the proper functioning of the flowmeter d...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملJust Noticeable Difference Estimation Using Visual Saliency in Images
Due to some physiological and physical limitations in the brain and the eye, the human visual system (HVS) is unable to perceive some changes in the visual signal whose range is lower than a certain threshold so-called just-noticeable distortion (JND) threshold. Visual attention (VA) provides a mechanism for selection of particular aspects of a visual scene so as to reduce the computational loa...
متن کاملOptimizing Flexible Manufacturing System: A Developed Computer Simulation Model
In recent years, flexible manufacturing system as a response to market demands has been proposed to increase product diversity, optimum utilization of machines andperiods of short-term products.The development of computer systems has provided the ability to build machines with high functionality and the necessary flexibility to perform various operations. However, due to the complexity and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.00159 شماره
صفحات -
تاریخ انتشار 2016